Search results for "Ethernet flow control"
showing 4 items of 4 documents
An evaluation of switched ethernet and linux traffic control for real-time transmission
2008
Switched Ethernet networks are spreading to industrial environments more are more. The current trend is using them at all levels of a factory, replacing this way field-buses and other industrial networks. Switched Ethernet lacks the drawback of the non-deterministic collision resolution of coax cabling. However there are still some sources of indeterminism, mostly due to contention problems in message queues at switches and network interfaces. These problems can be dealt with using traffic control mechanisms for packet prioritisation and scheduling. These features have been largely inaccessible in Ethernet for a long time but, nowadays, they are widely available in industrial switches and a…
Gigabit Ethernet backbones with active loops
2001
The current standard Ethernet switches are based on the Spanning Tree (ST) protocol. Their most important restriction is that they can not work when the topology has active loops. In fact, the ST protocol selects a tree from the real topology by blocking the links that are not involved in the tree. This restriction produces a network traffic unbalancing behavior saturating those link near the root switch while rest of links will be idle or with a very low utilization. This paper proposes a new transparent switch protocol for Gigabit Ethernet backbones that considerably improves the performance of current ones. The proposed protocol is named ALOR for Active Loops and Optimal Routing. ALOR pr…
A decentralized solution for the constrained minimum cost flow
2010
In this paper we propose a decentralized solution to the problem of network stabilization, under flow constraints ensuring steady—state flow optimality. We propose a stabilizing strategy for network flow control with capacity constraints which drives the buffer levels arbitrarily close to a desired reference. This is a decentralized strategy optimizing the flow via the minimization of a quadratic cost of the control. A second problem characterized by non-fully connected networks is also considered, for which an exact network equilibrium is not possible. Here, the strategy, in the absence of constraints leads to a least square decentralized problem, but, unfortunately, in the presence of con…
The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
2013
We present an algorithm for constrained network flow control in the presence of an unknown demand. Our algorithm is decentralized in the sense that it is implemented by a team of agents, each controlling just the flow on a single arc of the network based only on the buffer levels at the nodes at the extremes of the arc, while ignoring the actions of other agents and the network topology. We prove that our algorithm is also stabilizing and steady-state optimal. Specifically, we show that it asymptotically produces the minimum-norm flow. We finally generalize our algorithm to networks with a linear dynamics and we prove that certain least-square optimality properties still hold.